A Nondifferentiable Optimization Approach to Ratio-Cut Partitioning
نویسنده
چکیده
We propose a new method for finding the minimum ratio-cut of a graph. Ratio-cut is NP-hard problem for which the best previously known algorithm gi ves an O(log n)-factor approximation by solving its dually related maximum concurrent flow problem. We formulate the minimum ratio-cut as a certain nondifferentiable optimization problem, and sho w that the global minimum of the optimization problem is equal to the minimum ratio-cut. Moreover, we provide strong symbolic computation based evidence that any strict local minimum gives an approxi mation by a factor of 2. We also give an efficient heuristic algorithm for finding a local minimum of th e proposed optimization problem based on standard nondifferentiable optimization methods and evaluate its performance on several families of g raphs. We achieve O(n 1.6) experimentally obtained running time on these graphs.
منابع مشابه
Ratio Cut Hypergraph Partitioning Using Bdd Based Mboa Optimization Algorithm
This paper deals with the k-way ratio cut hypergraph partitioning utilizing the Mixed discrete continuous variant of the Bayesian Optimization Algorithm (mBOA). We have tested our algorithm on three partitioning taxonomies: recursive minimum ratio cut, multi-way minimum ratio cut and recursive minimum cut bisection. We have also derived a new approach for modeling of Boolean functions using bin...
متن کاملGlobally Optimizing Graph Partitioning Problems Using Message Passing
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut and the size of the partitions, this ratio leads to an NP-hard problem that is only solved approximately. This makes it difficult to know whether failures of the algorithm are due to failures of the optimization or to t...
متن کاملCombining problem reduction and adaptive multistart: a new technique for superior iterative partitioning
VLSI netlist partitioning has been addressed chie y by iterative methods (e.g. KernighanLin [21] and Fiduccia-Mattheyses [13]) and spectral methods (e.g. Hagen-Kahng [14]). Iterative methods are the de facto industry standard, but su er diminished stability and solution quality when instances grow large. Spectral methods have achieved high-quality solutions, particularly for the ratio cut objec...
متن کاملSpectral K - Way Ratio - Cut PartitioningPart I :
Recent research on partitioning has focussed on the ratio-cut cost metric which maintains a balance between the sizes of the edges cut and the sizes of the partitions without xing the size of the partitions a priori. Iterative approaches and spectral approaches to two-way ratio-cut partitioning have yielded higher quality partitioning results. In this paper we develop a spectral approach to mul...
متن کاملCsc5160: Combinatorial Optimization and Approximation Algorithms Topic: Graph Partitioning Problems 18.1 Graph Partitioning Problems 18.1.2 Multiway Cut
This lecture gives a general introduction of graph partitioning problems. We will begin with the definitions of some classic graph partitioning problems (e.g. multiway cut, multicut, sparsest cut), and discuss their relationships. Then we will focus on deriving two approximation algorithms. For the multiway cut problem, we will show a 2-approximation algorithm through a combinatorial argument. ...
متن کامل